An approach to parallel algorithm design
نویسندگان
چکیده
منابع مشابه
An Approach to Design Incremental Parallel Webcrawler
World Wide Web (WWW) is a huge repository of interlinked hypertext documents known as web pages. Users access these hypertext documents via Internet. Since its inception in 1990, WWW has become many folds in size, and now it contains more than 50 billion publicly accessible web documents distributed all over the world on thousands of web servers and still growing at exponential rate. It is very...
متن کاملAn Approach to Algorithm Design by Patterns
This paper proposes two behavioral patterns called DIVIDE-&-CONQUER and BACKTRACKING to facilitate the development of algorithms based upon algorithm design techniques. The common informal seudocode that specifies the solving strategy for a general algorithm design technique is enhanced to provide a helpful guide to develop particular algorithms by following the divide and conquer and the backt...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملAn approach to Improve Particle Swarm Optimization Algorithm Using CUDA
The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...
متن کاملCsci 493.65 Parallel Computing Chapter 3 Parallel Algorithm Design Chapter 3 Parallel Algorithm Design
A task consists of an executable unit (think of it as a program), together with its local memory and a collection of I/O ports. The local memory contains program code and private data, i.e., the data to which it has exclusive access. An access to this memory is called a local data access. The only way that a task can send copies of its local data to other tasks is through its output ports, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1993
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1993270200851